翻訳と辞書
Words near each other
・ Instituto Cervantes Sydney
・ Instituto Chaminade Marianistas
・ Instituto Comercial Alberto Valenzuela Llanos
・ Instituto Conmemorativo Gorgas de Estudios de la Salud
・ Instituto Costarricense de Electricidad
・ Instituto Cubano del Arte e Industria Cinematográficos
・ Instituto Cultural Dominico-Americano
・ Institutes of Natural and Revealed Religion
・ Institutes of technology in Ireland
・ Institutes of the Christian Religion
・ Institutes of the Lawes of England
・ Institutet för rättsinformatik
・ Institutio canonicorum Aquisgranensis
・ Institutio Oratoria
・ Institution
Institution (computer science)
・ Institution (disambiguation)
・ Institution Chrétienne d'Haïti
・ Institution des Chartreux
・ Institution des Invalides de la Legion Etrangere
・ Institution for Field Research Expeditions
・ Institution of Agricultural Engineers
・ Institution of Analysts and Programmers
・ Institution of Chemical Engineers
・ Institution of Civil Engineers
・ Institution of Civil Engineers Northern Ireland branch chairmen
・ Institution of Diesel and Gas Turbine Engineers
・ Institution of Electrical Engineers
・ Institution of Electronics and Telecommunication Engineers
・ Institution of Engineering and Technology (professional society)


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Institution (computer science) : ウィキペディア英語版
Institution (computer science)
The notion of institution has been created by Joseph Goguen and Rod Burstall in the late 1970s
in order to deal with the "population explosion among the logical systems used in
computer science". The notion tries to capture the essence of the concept of "logical system".〔J. A. Goguen and R. M. Burstall, Institutions: Abstract Model Theory for Specification and Programming, Journal of the Association for Computing Machinery 39, pp. 95–146, 1992.〕
The use of institutions makes it possible to develop concepts of specification languages (like structuring of specifications, parameterization, implementation, refinement, development), proof calculi and even tools in a way completely independent of the underlying logical system. There are also morphisms that allow to relate and translate logical systems. Important applications of this are re-use of logical structure (also called borrowing), heterogeneous specification and combination of logics.
The spread of institutional model theory has generalized various notions and results of model theory and institutions themselves have impacted the progress of universal logic.〔Razvan Diaconescu, "Three decades of institution theory"
in Universal Logic: An Anthology edited by Jean-Yves Béziau 2012 Springer
ISBN 978-3-0346-0144-3 pp 309-322〕
〔T. Mossakowski, J. A. Goguen, R. Diaconescu, A. Tarlecki, "What is a Logic?", '. In Jean-Yves Beziau (Ed.), (Logica Universalis: Towards a General Theory of Logic ), pp. 113–133. Birkhäuser, Basel, 2005, 2nd Edition 2007.〕
==Definition==
The theory of institutions does not assume anything about the nature of the logical system. That is, models and sentences may be arbitrary objects; the only assumption is that there is a satisfaction relation between models and sentences, telling whether a sentence holds in a model or not. Satisfaction is inspired by Tarski's truth definition, but can in fact be any binary relation.
A crucial feature of institutions now is that models, sentences and their satisfaction are always being considered to live in some vocabulary or context (called signature) that defines the (non-logical) symbols that may be used in sentences and that need to be interpreted in models. Moreover, signature morphisms allow to extend signatures, change notation etc. Nothing is assumed about signatures and signature morphisms except that signature morphisms can be composed; this amounts to having a
category of signatures and morphisms. Finally, it is assumed that signature morphisms lead to translations of sentences and models in a way that satisfaction is preserved. While sentences are translated along with signature morphisms (think of symbols being replaced along the morphism), models are translated (or better: reduced) against signature morphisms: for example, in case of a signature extension, a model of the (larger) target signature may be reduced to a model of the (smaller) source signature by just forgetting some components of the model.
Formally, an institution consists of
* a category Sign of signatures,
* a functor sen:Sign \to Set giving, for each signature \Sigma, the set of sentences sen(\Sigma), and for each signature morphism \sigma:\Sigma\to\Sigma', the sentence translation map sen(\sigma):sen(\Sigma)\to sen(\Sigma'), where often sen(\sigma)(\varphi) is written as \sigma(\varphi),
* a functor Mod:Sign^\toCat giving, for each signature \Sigma, the category of models Mod(\Sigma), and for each signature morphism \sigma:\Sigma\to\Sigma', the reduct functor Mod(\sigma):Mod(\Sigma')\to Mod(\Sigma), where often Mod(\sigma)(M') is written as M'|_,
* a satisfaction relation for each \Sigma\in Sign,
such that for each \sigma:\Sigma\to\Sigma' in Sign the following satisfaction condition holds:
M'\models_\sigma(\varphi) if and only if M'|_
\models_ \varphi
for each M'\in Mod(\Sigma') and \varphi\in sen(\Sigma).
The satisfaction condition expresses that truth is invariant under change of notation
(and also under enlargement or quotienting of context).
Strictly speaking, the model functor ends in the "category" of all large categories.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Institution (computer science)」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.